一个动态互连全透明训练系统

介绍一个动态互连全透明模拟训练系统设计过程,运用二级分布式结构实现实时模拟,并给出了某型导弹火力控制模拟系统硬件和多媒体软件结构模式     

基于最大熵谱估计验证战术导弹的气动模型

现代谱估计方法是验证系统仿真模型的有效方法。战术导弹飞行试验的遥、外测数据记录了大量的过程参数,可以利用这些参数进行气动力和气动力矩的计算,与飞行试验过程参数进行分析比较。应用最大熵谱估计检验导弹的气动力和气动力矩模型的可信性,可以给出定量的结果。文章给出的方法可以作为战术导弹气动参数模型研究的一种辅助手段。     

基于LPS模型的飞行器控制系统故障诊断方法

传统故障诊断方法一般针对测量信号而展开,未考虑其实际物理连接特性对故障诊断结果的显著影响。随着专业电气系统设计软件的广泛应用,设计人员容易获取系统的物理连接特性和逻辑连接特性。论文通过对产品层、系统层的信号、物理连接及其互连关系的分析,提出了一种将抽象的逻辑信号和具体的物理连线统一起来的逻辑物理综合(LPS)模型,并研究了基于导线表文件和网表文件的LPS模型实例化方法,开发了一套智能故障检测软件,进行了算例验证,结果表明：基于LPS模型的故障诊断方法能够将系统故障定位到指定产品级别上,具有极大的工程应用价值。     

Benders' cuts guided large neighborhood search for the traveling umpire problem

This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Batch scheduling on a two‐machine jobshop with machine‐dependent setup times

The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Periodic review inventory management with contingent use of two freight modes with fixed costs

We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

现行火灾事故调查制度应用分析及完善路径探讨

《火灾事故调查规定》是规范火灾事故调查,保障公安机关消防机构依法履行职责,保护火灾当事人合法权益的基本规章。结合《火灾事故调查规定》的应用实践,阐述了新修订的《火灾事故调查规定》一些制度设计对火灾事故调查工作的影响,分析了其适用中存在的问题,提出了解决这些问题的对策,有助于进一步完善火灾事故调查制度。     

基于聚类算法的多无人机系统任务分配

针对现有任务分配方法在任务点较多时不易解算,且计算量大的问题,提出了基于模糊C-均值聚类算法的多无人机系统任务分配方法.首先,利用模糊C-均值聚类算法得到的隶属度矩阵对任务点进行初始分配;其次,针对基于空间划分聚类可能造成各UAV任务不均衡的问题,设计任务的局部优化调整规则;最后,结合单旅行商问题,利用Tabu Sea...